The Pixel Microtelescope
نویسندگان
چکیده
We describe a vertex and/or tracking detector designed to operate in an environment in which there is a large density of background hits.
منابع مشابه
On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملاستفاده از مدل جاذبه برای استخراج انحنای مرز دریاچه سد
Introduction The attraction model algorithm spatially depends on the neighborhoods of the central pixels that are attracting surrounding sub-pixels. Another possibility is the hypothesis of subpixel interaction as introduced by Mertens et al. (2003) and Atkinson (2005). In order to reach a pixel state with the maximum number of sub-pixels of identical classes neighboring, there are several met...
متن کاملSteganalysis of embedding in difference of image pixel pairs by neural network
In this paper a steganalysis method is proposed for pixel value differencing method. This steganographic method, which has been immune against conventional attacks, performs the embedding in the difference of the values of pixel pairs. Therefore, the histogram of the differences of an embedded image is di_erent as compared with a cover image. A number of characteristics are identified in the di...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کامل